Parrondo Games as Lattice Gas Automata
نویسندگان
چکیده
Parrondo games are coin flipping games with the surprising property that alternating plays of two losing games can produce a winning game. We show that this phenomenon can be modelled by probabilistic lattice gas automata. Furthermore, motivated by the recent introduction of quantum coin flipping games, we show that quantum lattice gas automata provide an interesting definition for quantum Parrondo games. 2001 Physics and AstronomyClassification Scheme: 02.70.Ns, 05.40.Fb, 03.65.Pm, 02.50.Le. 2000 American Mathematical Society Subject Classification: 60J60, 82C10, 60G50, 91A15.
منابع مشابه
Lattice Gas Automata Simulation of Adsorption Process of Polymer in Porous Media
Lattice gas automata (LGA) model is developed to simulate polymer adsorption process by adding some collision rules. The simulation result of the model is matched with batch experiment and compared with accepted isothermal adsorption equations. They show that the model is viable to perform simulation of the polymer adsorption process. The LGA model is then applied for simulating continuous poly...
متن کاملAnalytical Expressions for Parrondo Games
We present some new analytical expressions for the so-called Parrondo effect, where simple coin-flipping games with negative expected value are combined into a winning game. Parrondo games are state-dependent. By identifying the game state variable, we can compute the stationary game state probabilities. Mixing losing games increases the probability of entering into a game state with positive v...
متن کاملParrondo games with spatial dependence, III
We study Toral’s Parrondo games with N players and one-dimensional spatial dependence as modified by Xie et al. Specifically, we use computer graphics to sketch the Parrondo and anti-Parrondo regions for 3 ≤ N ≤ 9. Our work was motivated by a recent paper of Li et al., who applied a state space reduction method to this model, reducing the number of states from 2 to N + 1. We show that their red...
متن کاملNoisy quantum Parrondo games
Alternating two fair coin flipping games can create a winning game. Such a Parrondo game is a discrete model for a thermal ratchet. Recently we have constructed quantum versions of these coin flipping games that display the same “paradoxical” behavior. In this paper we add noise to these quantum Parrondo games in order that they can be compared with continuum models of quantum ratchets. Simulat...
متن کاملParrondo Games and Quantum Algorithms
We pursue the possible connections between classical games and quantum computation. The Parrondo game is one in which a random combination of two losing games produces a winning game. We introduce novel realizations of this Parrondo effect in which the player can ‘win’ via random reflections and rotations of the state-vector, and connect these to known quantum algorithms. [email protected]...
متن کامل